Iterative linear programming solution of convex programs
نویسندگان
چکیده
منابع مشابه
Iterative Solution of Linear Systems
Recent advances in the eld of iterative methods for solving large linear systems are reviewed. The main focus is on developments in the area of conjugate gradient-type algorithms and Krylov subspace methods for non-Hermitian matrices .
متن کاملIterative Refinement for Linear Programming
We describe an iterative refinement procedure for computing extended precision or exact solutions to linear programming problems (LPs). Arbitrarily precise solutions can be computed by solving a sequence of closely related LPs with limited precision arithmetic. The LPs solved share the same constraint matrix as the original problem instance and are transformed only by modification of the object...
متن کاملConditioning of convex piecewise linear stochastic programs
In this paper we consider stochastic programming problems where the objective function is given as an expected value of a convex piecewise linear random function. With an optimal solution of such a problem we associate a condition number which characterizes well or ill conditioning of the problem. Using theory of Large Deviations we show that the sample size needed to calculate the optimal solu...
متن کاملIterative Estimation Maximization for Stochastic Linear and Convex Programs with Conditional-Value-at-Risk Constraints
We present a new algorithm, Iterative Estimation Maximization (IEM), for stochastic linear and convex programs with Conditional-Value-at-Risk (CVaR) constraints. IEM iteratively constructs a sequence of compact-sized linear, or convex, optimization problems, and solves them sequentially to find the optimal solution. The problem size IEM solves in each iteration is unaffected by the size of rand...
متن کاملConvex Quadratic Programming for Exact Solution of 0-1 Quadratic Programs
Let (QP ) be a 0-1 quadratic program which consists in minimizing a quadratic function subject to linear constraints. In this paper, we present a general method to solve (QP ) by reformulation of the problem into an equivalent 0-1 program with a convex quadratic objective function, followed by the use of a standard mixed integer quadratic programming solver. Our convexification method, which is...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Optimization Theory and Applications
سال: 1990
ISSN: 0022-3239,1573-2878
DOI: 10.1007/bf00941159